Extended Successive Elimination Algorithm for Fast Optimal Block Matching Motion Estimation
نویسندگان
چکیده
In this paper, we propose an extended successive elimination algorithm (SEA) for fast optimal block matching motion estimation (ME). By reinterpreting the typical sum of absolute differences measure, we can obtain additional decision criteria whether to discard the impossible candidate motion vectors. Experimental results show that the proposed algorithm reduces the computational complexity up to 19.85% on average comparing with the multilevel successive elimination algorithm. The proposed algorithm can be used with other SEA to improve the ME performance. Keywords-motion estimation; successive elimination algorithm; block matching
منابع مشابه
An Optimal Fast Full Search Motion Estimation and Suboptimal Motion Estimation Algorithms
The new fast full search motion estimation algorithm for optimal motion estimation is proposed in this paper. The Fast Computing Method (FCM) which calculates the tighter boundaries faster by exploiting the computational redundancy and the Best Initial Matching Error Predictive Method (BIMEPM) which predicts the best initial matching error that enables the early rejection of highly impossible c...
متن کاملEfficient tree structured motion estimation using successive elimination - Vision, Image and Signal Processing, IEE Proceedings-
In H.264/AVC, tree structured motion estimation enhances the coding efficiency significantly while dramatically increasing the computational complexity of block matching. In the paper, a successive elimination algorithm (SEA) is implemented in tree structured motion estimation with a simple and effective method to determine the initial motion vector, which exploits the strong correlation among ...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملAn Efficient Motion Multiple Reference F
The H.264/AVC coding standard allows more than one decoded frame reference frames to make full use of reducing temporal redundancy in a video sequence. However, motion estimation in multiple frames introduces tremendous computational complexity. This paper presents a fast full search motion estimation algorithm for multiple reference frame motion estimation. The proposed method can be applied t...
متن کاملAdvanced Multi-level Successive Elimination Algorithms Using the Locality of Pixels in Block
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced Multi-level Successive Elimination Algorithms are based on the Multi-level Successive Elimination Algorithm. Advanced Multi-level Successive Elimination Algorithms consist of two algorithms. The first algorithm is that when we calculate the sum of abs...
متن کامل